A Parallel Computing Method of Social Tag Cooccurrence Relation
نویسندگان
چکیده
Cooccurrence relation extraction of abundant tags is very significant for information retrieve and tag recommendation. This paper presents a parallel extraction method of tag cooccurrence relation based on cloud computing. At last, two experiments show that the parallel extraction method can improve the performance of retrievals greatly and have good scalability. The research may play a role in the facilitative effect on the expanding application of social tagging system with abundant, multiplex, complex annotated data.
منابع مشابه
A parallel tag affinity computation for social tagging systems using MapReduce
Tag affinity is the relationship between tags. It is a useful information for search and recommendation in social tagging systems. Tag affinity is measured by several types of tag cooccurrence frequency. The computation of tag affinity is a time-consuming task as the tagging information is accumulated. To alleviate this problem, we propose a parallel tag affinity computation method using MapRed...
متن کاملParallel computing using MPI and OpenMP on self-configured platform, UMZHPC.
Parallel computing is a topic of interest for a broad scientific community since it facilitates many time-consuming algorithms in different application domains.In this paper, we introduce a novel platform for parallel computing by using MPI and OpenMP programming languages based on set of networked PCs. UMZHPC is a free Linux-based parallel computing infrastructure that has been developed to cr...
متن کاملA Hybrid Neural Network Approach for Kinematic Modeling of a Novel 6-UPS Parallel Human-Like Mastication Robot
Introduction we aimed to introduce a 6-universal-prismatic-spherical (UPS) parallel mechanism for the human jaw motion and theoretically evaluate its kinematic problem. We proposed a strategy to provide a fast and accurate solution to the kinematic problem. The proposed strategy could accelerate the process of solution-finding for the direct kinematic problem by reducing the number of required ...
متن کاملAnalysis of Textural Features in Medical Images Using Medium-cost Parallel Computers
A valuable tool in the quantification of textural information in images is the cooccurrence matrix due to Haralick [1, 2]. Cooccurrence matrices are used to compute second order statistical features, which are then used in the detection of patterns in image texture [3, 4]. The construction of cooccurrence matrices is dependent on the direction you move through the original image. Even when the ...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013